Low Complexity Tail-biting Trellises for Some Extremal Self-Dual Codes
نویسندگان
چکیده
We obtain low complexity tail-biting trellises for some extremal self-dual codes for various lengths and fields such as the [12,6,6] ternary Golay code and a [24,12,8] Hermitian self-dual code over GF(4). These codes are obtained from a particular family of cyclic Tanner graphs called necklace factor graphs.
منابع مشابه
Tail-biting Trellises for Linear Codes and their Duals
Trellis representations of linear block codes are attractive because of their use in soft decision decoding algorithms. An interesting property that is known for conventional trellises is that the minimal conventional trellis (known to be unique) for a linear block code, and its dual have the same state-complexity profile. This interesting property follows from the BCJR construction [1] of the ...
متن کاملTail-Biting Trellises of Block Codes: Trellis Complexity and Viterbi Decoding Complexity
Tail-biting trellises of linear and nonlinear block codes are addressed. We refine the information-theoretic approach of a previous work on conventional trellis representation, and show that the same ideas carry over to tail-biting trellises. We present lower bounds on the state and branch complexity profiles of these representations. These bounds are expressed in terms of mutual information be...
متن کاملTrellis Representations for Linear Block Codes
Trellis Representations for Linear Block Codes Heide Gluesing-Luerssen University of Kentucky Department of Mathematics 715 Patterson Office Tower Lexington, KY 40506 USA During the last decade conventional and tail-biting trellis representations of linear block codes have gained a great deal of attention. A tail-biting trellis for a block code of length n is an edge-labeled layered graph on th...
متن کاملUnifying Views of Tail-Biting Trellises for Linear Block Codes
This thesis presents new techniques for the construction and specification of linear tail-biting trellises. Tail-biting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptions. Conventional trellises for block codes have a well understood underlying theory. On the other...
متن کاملThe structure of tail-biting trellises: minimality and basic principl
Basic structural properties of tail-biting trellises are investigated. We start with rigorous definitions of various types of minimality for tail-biting trellises. We then show that biproper and/or nonmergeable tail-biting trellises are not necessarily minimal, even though every minimal tail-biting trellis is biproper. Next, we introduce the notion of linear (or group) trellises and prove, by e...
متن کامل